1971E - Find the Car - CodeForces Solution


binary search math sortings

Please click on ads to support us..

Python Code:


def bs(a, i):
    low = 0
    high = len(a) - 1
    res = -1
    while low <= high:
        mid = (low + high) // 2
        if a[mid]  <= i:
            low = mid + 1
            res = mid
        else:
            high = mid - 1
    return res

for _ in range(int(input())):
    n,k,q = [int(x) for x in input().split()]
    a = [0] + [int(x) for x in input().split()]
    b = [0] + [int(x) for x in input().split()]
    d = []
    for i in range(q):
        d.append(int(input()))
    res = []
    for i in d:
        x = bs(a, i)
        if a[x] == a[-1]:
            res.append(b[x])
        else:
            res.append((b[x] + (i-a[x]) * (b[x+1]- b[x]) // (a[x+1]- a[x])))
    print(*res) 


Comments

Submit
0 Comments
More Questions

1538A - Stone Game
1454C - Sequence Transformation
165B - Burning Midnight Oil
17A - Noldbach problem
1350A - Orac and Factors
1373A - Donut Shops
26A - Almost Prime
1656E - Equal Tree Sums
1656B - Subtract Operation
1656A - Good Pairs
1367A - Short Substrings
87A - Trains
664A - Complicated GCD
1635D - Infinite Set
1462A - Favorite Sequence
1445B - Elimination
1656C - Make Equal With Mod
567A - Lineland Mail
1553A - Digits Sum
1359B - New Theatre Square
766A - Mahmoud and Longest Uncommon Subsequence
701B - Cells Not Under Attack
702A - Maximum Increase
1656D - K-good
1426A - Floor Number
876A - Trip For Meal
1326B - Maximums
1635C - Differential Sorting
961A - Tetris
1635B - Avoid Local Maximums